Reliability Analysis for Multistate Consecutive k-out-of-n: F System Using Bayesian Network
نویسندگان
چکیده
This paper aims to determine the reliability of a complex system using Bayesian network. A network (BN) is probabilistic graphical model that represents knowledge about an uncertain domain where each component corresponds random variable and edge corresponding conditional probability. used estimate multistate consecutive k-out-of-n: F reliability. presents construction proposed system. The linear circular systems based on are compared. Furthermore, shown be significantly greater than exact obtained by Amirian, Khodadadi, Chatrabgoun.
منابع مشابه
Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملReliability Analysis of Consecutive-k, r-Out-Of-n: DFM System using GERT
Koutras (1997) analyzed reliability of a consecutive-k, r-out-of-n: DFM system consisting of n components linearly arranged which fails if and only if at least k consecutive components are failed-open or at least r consecutive components are failed-short. In this paper Graphical Evaluation and Review Technique (GERT) has been applied to model and analyze the reliability of the above system. On...
متن کاملRecursive Equations of Reliability for Linear Consecutive - k - out - of - n : F Systems with Sparse
In this paper, some recursive equations of reliability for linear consecutivek -out-ofn : F systems with spares d are introduced. The system of consecutive failures with sparse d is a generalized extension of consecutive-k systems, which was proposed by Zhao et al. (2007) in which the reliability formulas of these systems were presented by using finite Markov Chain imbedding approach. To facili...
متن کاملNew Improved Bounds for Reliability of Consecutive-k-out-of-n :f Systems
New bounds are found for the reliability of consecutive-k-out-of-n:F systems with equal component failure probabilities. The expressions involved are simple, thus allowing a direct use in the derivation of theoretical properties. These bounds can also be employed in numerical computations when the value of n or k is so large that the exact calculation of the reliability is not achievable. Compa...
متن کاملAn Efficient Algorithm for Computing the Reliability of Consecutive-k-Out-Of-n: F Systems
Many algorithms for computing the reliability of linear or circular consecutive-k-out-of-n:F systems appeared in this Transactions. The best complexity estimate obtained for solving this problem is O(k log(n/k)) operations in the case of i.i.d. components. Using fast algorithms for computing a selected term of a linear recurrence with constant coefficients, we provide an algorithm having arithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical modelling of engineering problems
سال: 2023
ISSN: ['2369-0739', '2369-0747']
DOI: https://doi.org/10.18280/mmep.100231